Cargo securing under multi-drop and axle weight constraints
نویسندگان
چکیده
This study emerges from a real-world cargo securing application to ensure safer road transportation and falls into the category of container loading problems with practical constraints. The literature has lacked efficient methods for secure items non-identical dimensions, weights rotations containers while ensuring that efforts necessary are minimal when also taking account multi-drop axle weight paper puts forward new way stability gives rise novel combinatorial optimization problem, which is generalization two-dimensional rectangular strip packing problem orthogonal rotations. We formally demonstrate intractability provide mixed integer programming formulation. formulation based on discretization polyhedron, enabling us model range complicated A group constraints tends be large in number makes it difficult solve reasonable amount time. In order overcome this difficulty, we develop an exact algorithmic framework. framework initially solves certain relaxations obtain strong lower bounds before subsequently embedding those branch-and-cut algorithm. experimental serves three purposes: (i) evaluating performance mathematical assess merits two methods, (ii) identifying characteristics hard instances (iii) extracting insights regarding challenges help managers practitioners decision making.
منابع مشابه
Container loading with multi-drop constraints
In this thesis, we develop an algorithm for the container loading problem (CLP) with multi-drop constraints. The CLP is the problem of loading the maximal value of a set of boxes into a container, while ensuring that the boxes neither overlap each other nor the container walls. By adding multi-drop constraints it is further demanded, that the relevant boxes must be available, without rearrangin...
متن کاملDynamic Cargo Trains Scheduling for Tackling Network Constraints and Costs Emanating from Tardiness and Earliness
This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based...
متن کاملIterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is an extension of the classical Capacitated Vehicle Routing Problem (CVRP). It integrates loading constraints in a routing problem and is based on a real-world transportation problem. The demand of the customers consists of pallets. These pallets may be placed in two horizontal rows inside th...
متن کاملMining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multilevel association rules uses concept hierarchies, also called taxonomies and defined as relations of type 'is-a' between objects, to extract rules that items belong to different levels of abstraction. These rules are m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2023
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2022.08.031